RATIONALIZING CHOICE WITH MULTI-SELF MODELS By
نویسندگان
چکیده
This paper studies a class of multi-self decision-making models proposed in economics, psychology, and marketing. In this class, choices arise from the set-dependent aggregation of a collection of utility functions, where the aggregation procedure satisfies some simple properties. We propose a method for characterizing the extent of irrationality in a choice behavior, and use this measure to provide a lower bound on the set of choice behaviors that can be rationalized with n utility functions. Under an additional assumption (scale-invariance), we show that generically at most five “reasons” are needed for every “mistake.” JEL Codes: D11, D13, D71
منابع مشابه
Rationalizing Choice with Multi-Self Models
This paper shows that in situations in which the preferences of multiple selves are aggregated into a collective decision, even if the researcher has a fully specified theory of how preferences get aggregated, there are typically no testable implications of the theory unless there is an a priori restriction on the number of selves. This result has implications in both interpersonal and intraper...
متن کاملOn Calibration and Application of Logit-Based Stochastic Traffic Assignment Models
There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...
متن کاملتوسعه دو مدل ریاضی کارا برای مسئله کولهپشتی چند انتخابی فازی
Multi-choice knapsack problem is a branch of regular knapsack problem where the objects are classified in different classes and each class has one and only one representative in final solution. Although it is assumed that each object belongs to just one class, sometimes this assumption is not valid in real problems. In this case an object may belong to the several classes. In fuzzy multi-choic...
متن کاملMaximal-Element Rationalizability∗
We examine the maximal-element rationalizability of choice functions with arbitrary domains. While rationality formulated in terms of the choice of greatest elements according to a rationalizing relation has been analyzed relatively thoroughly in the earlier literature, this is not the case for maximal-element rationalizability, except when it coincides with greatest-element rationalizability b...
متن کاملRationalizing Boundedly Rational Choice: Sequential Rationalizability and Rational Shortlist Methods
Rationalizing Boundedly Rational Choice: Sequential Rationalizability and Rational Shortlist Methods A sequentially rationalizable choice function is a choice function which can be obtained by applying sequentially a fixed set of asymmetric binary relations (rationales). A Rational ShortlistMethod (RSM) is a choice function which is sequentially rationalizable by two rationales. These concepts ...
متن کامل